A scaling limit for the length of the longest cycle in a sparse random digraph

We discuss the length of the longest directed cycle in the sparse random digraph , constant. We show that for large there exists a function such that a.s. The function where is a polynomial in . We are only able to explicitly give the values , although we could in principle compute any .     

Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].     

Interface‐fitted moving mesh method for axisymmetric two‐phase flow in microchannels

A boundary‐fitted moving mesh scheme is presented for the simulation of two‐phase flow in two‐dimensional and axisymmetric geometries. The incompressible Navier‐Stokes equations are solved using the finite element method, and the mini element is used to satisfy the inf‐sup condition. The interface between the phases is represented explicitly by an interface adapted mesh, thus allowing a sharp transition of the fluid properties. Surface tension is modelled as a volume force and is discretized in a consistent manner, thus allowing to obtain exact equilibrium (up to rounding errors) with the pressure gradient. This is demonstrated for a spherical droplet moving in a constant flow field. The curvature of the interface, required for the surface tension term, is efficiently computed with simple but very accurate geometric formulas. An adaptive moving mesh technique, where smoothing mesh velocities and remeshing are used to preserve the mesh quality, is developed and presented. Mesh refinement strategies, allowing tailoring of the refinement of the computational mesh, are also discussed. Accuracy and robustness of the present method are demonstrated on several validation test cases. The method is developed with the prospect of being applied to microfluidic flows and the simulation of microchannel evaporators used for electronics cooling. Therefore, the simulation results for the flow of a bubble in a microchannel are presented and compared to experimental data.     

次线性期望下的一般中心极限定理

受Peng-中心极限定理的启发,本文主要应用G-正态分布的概念,放宽Peng-中心极限定理的条件,在次线性期望下得到形式更为一般的中心极限定理.首先,将均值条件E[X_n]=ε[X_n]=0放宽为|E[X_n]|+|ε[X_n]|=O(1/n);其次,应用随机变量截断的方法,放宽随机变量的2阶矩与2+δ阶矩条件;最后,将该定理的Peng-独立性条件进行放宽,得到卷积独立随机变量的中心极限定理.     

Law of the iterated logarithm for random graphs

A milestone in probability theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables with mean 0 and variance 1 In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph H. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random k‐uniform hypergraphs, we obtain the Central Limit Theorem and LIL for the number of Hamilton cycles.     

Invariant discrete flows

In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself.     

A Runge-Kutta–based WENO reconstruction on moving mesh for compressible fluids

In this paper, we construct a high-order moving mesh method based on total variation diminishing Runge-Kutta and weighted essential nonoscillatory reconstruction for compressible fluid system. Beginning with the integral form of fluid system, we get the semidiscrete system with an arbitrary mesh velocity. We use weighted essential nonoscillatory reconstruction to get the space accuracy on moving meshes, and the time accuracy is obtained by modified Runge-Kutta method; the mesh velocity is determined by moving mesh method. One- and two-dimensional numerical examples are presented to demonstrate the efficient and accurate performance of the scheme.     

A proper orthogonal decomposition variational multiscale meshless interpolating element-free Galerkin method for incompressible magnetohydrodynamics flow

In the recent decade, the meshless methods have been handled for solving most of PDEs due to easiness of the meshless methods. One of the popular meshless methods is the element-free Galerkin (EFG) method that was first proposed for solving some problems in the solid mechanics. The test and trial functions of the EFG are based on the special basis. Recently, some modifications have been developed to improve the EFG method. One of these improvements is the variational multiscale EFG procedure. In the current article, the shape functions of interpolation moving least squares approximation have been applied to the variational multiscale EFG technique for solving the incompressible magnetohydrodynamics flow. In order to reduce the elapsed CPU time of simulation, we employ a reduced-order model based on the proper orthogonal decomposition technique. The current combination can be referred to as the reduced-order variational multiscale EFG technique. To illustrate the reduction in CPU time used as well as the efficiency of the proposed method, we applied it for the two-dimensional cases.